Flips in Edge-Labelled Pseudo-Triangulations
نویسندگان
چکیده
We show that O(n) exchanging flips suffice to transform any edge-labelled pointed pseudo-triangulation into any other with the same set of labels. By using insertion, deletion and exchanging flips, we can transform any edge-labelled pseudo-triangulation into any other with O(n log c+h log h) flips, where c is the number of convex layers and h is the number of points on the convex hull.
منابع مشابه
Flipping edge-labelled triangulations
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique labels to the triangulation edges. We introduce the concept of the orbit of an edge e, which is the set of all edges reachable from e via flips. We establish the...
متن کاملPseudo-tetrahedral complexes
A pseudo-triangulation is a cell complex in the plane whose cells are pseudo-triangles, i.e., simple polygons with exactly three convex vertices (so-called corners). Being an interesting and flexible generalization of triangulations, pseudo-triangulations have found their place in computational geometry; see e.g. [8, 11, 7, 1] and references therein. Unlike triangulations, pseudo-triangulations...
متن کاملOn Flips in Triangulations
We review a selection of results concerning edge flips in triangulations concentrating mainly on various aspects of the following problem: Given two different triangulations, how many edge flips are necessary and sufficient to transform one triangulation into another. We study the problem both from a combinatorial perspective (where only a combinatorial embedding of the triangulation is specifi...
متن کاملDiagonal Flips in Labelled Planar Triangulations
A classical result of Wagner states that any two (unlabelled) planar triangulations with the same number of vertices can be transformed into each other by a finite sequence of diagonal flips. Recently Komuro gives a linear bound on the maximum number of diagonal flips needed for such a transformation. In this paper we show that any two labelled triangulations can be transformed into each other ...
متن کاملA Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a labe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 60 شماره
صفحات -
تاریخ انتشار 2015